/// @tags:
#include <cstdio>
#include <functional>
#include <iostream>
#include <numeric>

using std::cin, std::cout, std::endl;

namespace BlueQuantum {

constexpr int maxn = 2e5 + 2;

int a[maxn], ans[maxn], hash[maxn];

int hashcnt;

int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
    hash[i] = a[i];
  }
  std::sort(hash + 1, hash + n + 1);
  hashcnt = std::unique(hash + 1, hash + n + 1) - hash - 1;
  for (int i = 1; i <= n; ++i) {
    int index = std::lower_bound(hash + 1, hash + hashcnt + 1, a[i]) - hash;
    ans[hashcnt - index]++;
  }
  for (int i = 0; i < n; ++i) {
    cout << ans[i] << '\n';
  }
  return 0;
}

}  // namespace BlueQuantum

int main() {
#ifndef ONLINE_JUDGE
#ifdef LOCAL
  freopen("/tmp/CodeTmp/testdata.in", "r", stdin);
  freopen("/tmp/CodeTmp/testdata.out", "w", stdout);
#else
  freopen("C - (K+1)-th Largest Number.in", "r", stdin);
  freopen("C - (K+1)-th Largest Number.out", "w", stdout);
#endif
#endif

  std::ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  return BlueQuantum::main();
}
